Viatcheslav Kourktchi
kourktchi@ukrtop.com
master's degree competitor (faculty of computer engineering and computer science)
research teacher:
Yuri Ladyzhensky

master's work topic:
Parallel algorithms for graph problems solving.

     For researched topic prevalence definition, the following research was realized: a number of inquiries was given to a number popular search cites in Internet and the amount of found to inquiry pages is fixed.
     The results were taken in a table.

     19.03.2004

Запрос	Google	Rambler	Yandex	Meta-Ukraine
Теория графов	6210	11448	14138	1600
Задача о наибольшем независимом множестве	1	10346	43	1993
Задача о наибольшей клике	34	10346	98	117
Параллельные алгоритмы	4430	14044	702	2503
Параллельные алгоритмы на графах	191	1948	171	211
Graph theory	2020000	1774	2407	147
Maximum independent set	2520000	4763	77	1071
Maximum clique problem	31500	94	736	12
Parallel algorithms	1860000	3056	508	417
Parallel algorithms for graphs	227000	684	47	64
Neuro networks for graph theory	6760	41	90	7
Tabu search for graph theory	6760	10	730	0
Genetic algorithms for graph theory	49600	175	159	7
Greedy heuristic for graph theory	14800	15	133	0
Simulated annealing for graph theory	20600	85	636	5
NP-complete problems	121000	597	123	22
NP-completeness in graph theory	23300	68	44	1